Buffer overflow period in a batch-arrival queue with autocorrelated arrivals

نویسنده

  • Andrzej Chydzinski
چکیده

In this paper a study on the buffer overflow period in a finite-buffer queue is presented. A special attention is paid to the autocorrelation and batch arrivals, which are supposed to mimic the properties of real arrival processes. Using the batch Markovian arrival process, formulas for the duration of the first, subsequent and stationary overflow periods, as well as formulas for the distribution of the number of consecutive losses during the overflow period are shown. Moreover, analytical results are illustrated via numerical examples. In particular, the influence of the autocorrelation and batch arrivals on the duration of the overflow period is demonstrated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transient and Stationary Losses in a Finite-Buffer Queue with Batch Arrivals

We present an analysis of the number of losses, caused by the buffer overflows, in a finite-buffer queue with batch arrivals and autocorrelated interarrival times. Using the batchMarkovian arrival process, the formulas for the average number of losses in a finite time interval and the stationary loss ratio are shown. In addition, several numerical examples are presented, including illustrations...

متن کامل

Buffer Overflow Period in a Constant Service Rate Queue

– When we speak about the buffer overflow period we mean the time interval in which the queue size is equal to the capacity of the buffer. Thus packets or cells arriving during this period are lost. The distribution of the length of this interval is recently gaining attention as a very informative characteristic of the queueing performance. In this paper the numerous results related to the dist...

متن کامل

Packet dropping characteristics in a queue with autocorrelated arrivals

This paper provides a detailed description of the packet dropping process connected with the buffer overflows in a network node. Namely, we show the formulas for the most important loss characteristics, both in the transient and the stationary regime and then illustrate them via numerical examples. In order to make it possible to obtain the dropping characteristics for strongly autocorrelated a...

متن کامل

Efficient Simulation of Buffer Overflow in Queueing Networks

Consider a continuous-time queueing network with probabilistic routing, including feedback. External batch arrival and batch service processes are characterized by independent Markov additive processes (MAPs). An effective change of measure is proposed for use in importance sampling procedure to estimate the probability of buffer overflow in an arbitrary (‘target’) queue during its busy period....

متن کامل

Estimation of Buffer Overflow Probabilities and Economies of Scale in ATM Multiplexers by Analysis of a Model of Packetized Voice Traffic

Estimation of Buffer Overflow Probabilities and Economies of Scale in ATM M ultiplexers by Analysis of a M odel of Packetized Voice Traffic by Paul J. Farrell We obtain upper bounds on the probability of buffer overflow for an ATM multiplexer of L identical packetized voice sources The multiplexer is modelled by a FCFS single server queue The arrivals at the multiplexer are a homogenous superpo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013